Message passing and scheduling in Osprey
نویسندگان
چکیده
Future systems for multi-core architectures will have to be highly parallelizable to utilize hardware and will have to avoid sharing to achieve good performance. Consequently, novel operating system designs gradually move towards asynchronous message-based communication and decentralized scheduling. In this paper we describe a message passing and scheduling architecture which provides main communication and synchronization instruments for the Osprey operating system. The architecture supports blocking and non-blocking communication, allows user-level threads, processes, kernel tasks, and cores to be suspended, supports address space transitions, and provides real-time scheduling.
منابع مشابه
Solving scheduling problems using parallel message-passing based constraint programming
We discuss some of the engineering challenges in implementing a constraint programming based scheduling engine to scale well on massively parallel computer hardware. In particular, we have been targeting our solvers to work in high performance computer environments such as the IBM BlueGene/P supercomputer. On such hardware parallelism is enabled at the software level using message passing, base...
متن کاملMessage passing support on StarT-Voyager
No single message passing mechanism can efficiently support all types of communication that commonly occur in most parallel or distributed programs. MIT’s StarT-Voyager, a hybrid message passing/shared memory parallel machine, provides four message passing mechanisms to achieve high performance over a wide spectrum of communication types and sizes. Hardware and address translation enforced prot...
متن کاملTime Complexity of a Matrix Product on Message Passing Architectures
The use of an appropriate methodology for calculating the communication cost, time complexity and performing task scheduling in massively parallel processing systems plays a significant role in improving the functionality of a message-passing architecture. This paper presents an existing message passing architecture (MSH 4-Cube) which is based on Master-Slave Super-Hypercube (MSSHP) topology. B...
متن کاملMemory Centric Interconnection Mechanism for Message Passing in Parallel Systems
The Interconnection Network (IN) connecting computing nodes in parallel systems has become one of the key research issues in parallel computer architecture. Traditionally, the INs in parallel systems for message passing have been built on the basis of logic circuits with different topology structures. Currently, the bandwidth of data transmission for message passing in available parallel system...
متن کاملInformed Dynamic Scheduling for Belief-Propagation Decoding of LDPC Codes
Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation, or message-passing, algorithm over the factor graph of the code. The traditional message-passing schedule consists of updating all the variable nodes in the graph, using the same pre-update information, followed by updating all the check nodes of the graph, again, using the same pre-update info...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013